/* Complet (Autocompletion through Graph Databases)
 *  Copyright (C) 2012  Paul Wagner, Till Speicher
 *
 *  This program is free software; you can redistribute it and/or modify it
 *  under the terms of the GNU General Public License as published by the
 *  Free Software Foundation; either version 3 of the License, or (at your
 *  option) any later version.
 *
 *  This program is distributed in the hope that it will be useful, but
 *  WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
 *  or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
 *  for more details.
 *
 *  You should have received a copy of the GNU General Public License along
 *  with this program; if not, see <http:/* www.gnu.org/licenses/>.
*/

/*
 * Class representing a single word
 *
 * @author Paul Wagner
 *
 */

package complet.db;

import org.neo4j.graphdb.Node;


public class Word {

    // PROPERTIES
    private Node NODE;
    private String WORD;
    private Integer SUM_COUNT;  // Gewichtete Aufsummierung der counts
    private Double AVG_REL;  // Gewichteter normierter Durchschnitt
    private Integer PRM_COUNT;	// Haeufigkeit des Wortes

    public Word(Node node, String word, Integer count, double rel, Integer prm_count){
        this.NODE = node;
        this.WORD = word;
        this.SUM_COUNT = count;
        this.AVG_REL = rel;
        this.PRM_COUNT = prm_count;
    }

    public Word (Word w){
        this.NODE = w.NODE;
        this.WORD = w.WORD;
        this.SUM_COUNT = w.SUM_COUNT;
        this.AVG_REL = w.AVG_REL;
        this.PRM_COUNT = w.PRM_COUNT;
    }

    // GETTER
    public Integer getSUM_COUNT() {
        return SUM_COUNT;
    }

    public Node getNODE() {
        return NODE;
    }

    public Double getAVG_REL() {
        return AVG_REL;
    }

    public String getWORD() {
        return WORD;
    }
    
    public Integer getPRM_COUNT() {
    	return PRM_COUNT;
    }

}
